Asymptotic Analysis for Markovian Retrial Queues with Two Types of Nonpersistent Customers
نویسنده
چکیده
We consider Markovian multiserver retrial queues where a blocked customer has two opportunities for abandonment: at the moment of blocking or at the departure epoch from the orbit. In this queueing system, the number of customers in the system (servers and buffer) and that in the orbit form a level-dependent quasi-birth-and-death (QBD) process whose stationary distribution is expressed in terms of a sequence of rate matrices. Using a simple perturbation technique and a matrix analytic method, we derive Taylor series expansion for nonzero elements of the rate matrices with respect to the number of customers in the orbit. We also obtain explicit expressions for all the coefficients of the expansion. Furthermore, we derive tail asymptotic formulae for the joint stationary distribution of the number of customers in the system and that in the orbit. Numerical examples reveal that the tail probability of the model with two types of nonpersistent customers is greater than that of the corresponding model with one type of nonpersistent customers.
منابع مشابه
Multiserver retrial Queues with Two Types of nonpersistent Customers
We consider M/M/c/K (K ≥ c ≥ 1) retrial queues with two types of nonpersistent customers, which are motivated from modelling of service systems such as call centers. Arriving customers that see the system fully occupied either join the orbit or abandon receiving service forever. After an exponentially distributed time in the orbit, each customer either abandons the system forever or retries to ...
متن کاملAlgorithmic approach to Markovian multi-server retrial queues with vacations
There are many practical situations that have both features of customer retrials and server vacations. The vacation policy is characterized by the vacation startup rules and vacation termination rules. The queueing system with retrials and vacations has been described in variety of ways according to the vacation rules and retrial policies such as constant retrial policy and linear retrial polic...
متن کاملUnreliable bulk retrial queues with delayed repairs and modified vacation policy
The present investigation deals with the bulk arrival M/G/1 retrial queue with impatient customers and modified vacation policy. The incoming customers join the virtual pool of customers called orbit if they find the server being busy, on vacation or in broken down state otherwise the service of the customer at the head of the batch is started by the server. The service is provided in k</em...
متن کاملStability of Retrial Queues with Versatile Retrial Policy
We consider in this paper the stability of retrial queues with a versatile retrial policy. We obtain sufficient conditions for the stability by the strong coupling convergence to a stationary ergodic regime for various models of retrial queues including a model with two types of customers, a model with breakdowns of the server, a model with negative customers, and a model with batch arrivals. F...
متن کاملAnalysis of the Number of Orbiting Customers in M/g/1 Retrial Queue with General Retrial Times
The research in the area of retrial queues focused mainly on the fact that the retrials operate under classical retrial policy, which suppose that the intervals between successive repeated attempts are exponentially distributed with total rate jθ (j is the number of customers in the orbit). There is another discipline, called constant retrial policy, where the total retrial rate does not depend...
متن کامل